#include "AVLTree.h"

template<typename T>
int AVLTree<T>::NodeAVL::insert(const T& e, u64 k) {
    if( k < this->key ) {
        if( this->inc ) {
            //Rééquilibrer T si nécessaire...
            this->rebalance();
        }
    } else if( k > this->key() ) {
        //Insert(Right(T)), e, inc);
        if(this->right)
            _bal += this->right->insert(e, k);
        else {
            this->right = new NodeAVL(e,k);
            this->inc = false;
        }
        if( this->inc )
            this->rebalance();
    }
}

template<typename T>
void AVLTree<T>::NodeAVL::rebalance() {
    
}

